منابع مشابه
Optimal Linear Codes Over GF(7) and GF(11) with Dimension 3
Let $n_q(k,d)$ denote the smallest value of $n$ for which there exists a linear $[n,k,d]$-code over the Galois field $GF(q)$. An $[n,k,d]$-code whose length is equal to $n_q(k,d)$ is called {em optimal}. In this paper we present some matrix generators for the family of optimal $[n,3,d]$ codes over $GF(7)$ and $GF(11)$. Most of our given codes in $GF(7)$ are non-isomorphic with the codes pre...
متن کاملDual-Field Arithmetic Unit for GF(p) and GF(2m)
In this article we present a hardware solution for finite field arithmetic with application in asymmetric cryptography. It supports calculation in GF (p) as well as in GF (2). Addition and multiplication with interleaved modular reduction are the main functionality of the unit. Additional functions—like shift operations and integer incrementation—allow the calculation of the multiplicative inve...
متن کاملRTL Implementations of GF ( 2 ) and GF ( 4 ) Arithmetic Components
Logic design for security application requires the use of specific encoding and higher radix elements thus implying an additional level of abstraction – a component level which is subsequently mapped into a gate level netlist. Implementation of particular components can be made in different ways, however RTL-based design of the multi-valued logic components is of more practical interest as it b...
متن کاملSoliton-Like LT Codes over GF(4) and GF(8)
The Luby Transform (LT) codes are the first practical realization of fountain codes. LT codes were designed for efficient use over erasure channels. However, the degree distributions designed for the Binary Erasure Channel (BEC), such as the Robust Soliton Distribution (RSD) which are asymptotically and universally optimal over the BEC, are not optimal over noisy channels. Research has been don...
متن کاملBicircular matroids representable over GF(4) or GF(5)
Given a bicircular matroid B(G) and q ∈ {4, 5}, we characterize when the bicircular matroid B(G) is GF (q)-representable by precisely describing the structure of G. These descriptions yield polynomial-time algorithms with input G to certify if B(G) is or is not GF (q)-representable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Japanese Journal of Urology
سال: 1955
ISSN: 0021-5287,1884-7110
DOI: 10.5980/jpnjurol1928.46.5_361